Programming and automating mathematics in the Tarski-Kleene hierarchy
نویسندگان
چکیده
We present examples from a reference implementation of variants of Kleene algebras and Tarski’s relation algebras in the theorem proving environment Isabelle/HOL. For Kleene algebras we show how models can be programmed, including sets of traces and paths, languages, binary relations, max-plus and min-plus algebra, matrices, formal power series. For relation algebras we discuss primarily proof automation in a comprehensive library and present an advanced formalisation example.
منابع مشابه
Fuzzy Linear Programming Method for Deriving Priorities in the Fuzzy Analytic Hierarchy Process
There are various methods for obtaining the preference vector of pair-wise comparison matrix factors. These methods can be employed when the elements of pair-wise comparison matrix are crisp while they are inefficient for fuzzy elements of pair-wise comparison matrix. In this paper, a method is proposed by which the preference vector of pair-wise comparison matrix elements can be obtained even ...
متن کاملTopology Proceedings
Many questions concerning the semantics of disjunctive databases and of logic programming systems depend on the fixed points of various multivalued mappings and operators determined by the database or program. We discuss known versions, for multivalued mappings, of the Knaster-Tarski theorem and of the Banach contraction mapping theorem, and formulate a version of the classical fixed-point theo...
متن کاملKleene Chain Completeness and Fixedpoint Properties
Fixedpoint theorems play a fundamental role in denotational semantics of programming languages. In 1955, Tarski [6] and Davis [l] showed that a lattice L is complete if and only if every monotonic function f: L + L has a fixedpoint. Since then, other fixedpoint properties are considered, by imposing either the function to be o-continuous or the fixedpoint to be the least fixedpoint. The key que...
متن کاملTarski Number and Configuration Equations
The concept of configuration of groups which is defined in terms of finite partitions and finite strings of elements of the group is presented by Rosenblatt and Willis. To each set of configurations, a finite system of equations known as configuration equations, is associated. Rosenblatt and Willis proved that a discrete group G is amenable if and only if every possible instance of its configur...
متن کاملAn iterative method for tri-level quadratic fractional programming problems using fuzzy goal programming approach
Tri-level optimization problems are optimization problems with three nested hierarchical structures, where in most cases conflicting objectives are set at each level of hierarchy. Such problems are common in management, engineering designs and in decision making situations in general, and are known to be strongly NP-hard. Existing solution methods lack universality in solving these types of pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Log. Algebr. Meth. Program.
دوره 83 شماره
صفحات -
تاریخ انتشار 2014